منابع مشابه
Convex Hulls, Occluding Contours, Aspect Graphs and the Hough Transform
The Hough transform is a standard technique for finding features such as lines in images. Typically edgels or other features are mapped into a partitioned parameter or Hough space as individual votes. The target image features are detected as peaks in the Hough space. In this paper we consider not just the peaks but the mapping of the entire shape boundary from image space to the Hough paramete...
متن کاملFormalizing Convex Hulls Algorithms
We study the development of formally proved algorithms for computational geometry. The result of this work is a formal description of the basic principles that make convex hull algorithms work and two programs that implement convex hull computation and have been automatically obtained from formally verified mathematical proofs. A special attention has been given to handling degenerated cases th...
متن کاملSteaming on Convex Hulls
This is a sea story about using a simple classroom example to save a great deal of money, as well as to convince beginning Postgraduate Naval School operations research students—experienced, skeptical military officers—that mathematical analysis can yield immediate results. The application is planning a ship’s transit from one point to another in a fixed amount of time, given that the ship can ...
متن کاملConvex hulls of spheres and convex hulls of disjoint convex polytopes
Given a set Σ of spheres in E, with d ≥ 3 and d odd, having a constant number of m distinct radii ρ1, ρ2, . . . , ρm, we show that the worst-case combinatorial complexity of the convex hull of Σ is Θ( ∑ 1≤i6=j≤m nin ⌊ d 2 ⌋ j ), where ni is the number of spheres in Σ with radius ρi. To prove the lower bound, we construct a set of Θ(n1+n2) spheres in E , with d ≥ 3 odd, where ni spheres have rad...
متن کاملConvex Hulls of Bounded Curvature
In this paper, we consider the problem of computing a convex hull of bounded curvature of a set S of points in the plane, i.e. a set containing S and whose boundary is a curve of bounded curvature of minimal length. We prove that, if the radius of the smallest disk that contains S is greater than 1, such a hull is unique. We show that the computation of a convex hull of bounded curvature reduce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1992
ISSN: 0377-0427
DOI: 10.1016/0377-0427(92)90250-2